OCL2FOL+: Coping with Undefinedness
نویسندگان
چکیده
At present, the OCL language includes two constants, null and invalid, to represent undefinedness. This effectively turns OCL into a four-valued logic. It makes also problematic its mapping to first-order logic and, as a consequence, hinders the use of first-order automated-reasoning tools for OCL reasoning. We address this problem and propose a solution, grounded on the same principles underlying OCL2FOL, in order to cope with undefinedness in OCL.
منابع مشابه
Minimal Undefinedness for Fuzzy Answer Sets
Fuzzy Answer Set Programming (FASP) combines the nonmonotonic reasoning typical of Answer Set Programming with the capability of Fuzzy Logic to deal with imprecise information and paraconsistent reasoning. In the context of paraconsistent reasoning, the fundamental principle of minimal undefinedness states that truth degrees close to 0 and 1 should be preferred to those close to 0.5, to minimiz...
متن کاملAndrews' Type Theory with Undefinedness
Q0 is an elegant version of Church’s type theory formulated and extensively studied by Peter B. Andrews. Like other traditional logics, Q0 does not admit undefined terms. The traditional approach to undefinedness in mathematical practice is to treat undefined terms as legitimate, nondenoting terms that can be components of meaningful statements. Qu0 is a modification of Andrews’ type theory Q0 ...
متن کاملFormalizing Undefinedness Arising in Calculus
Undefined terms are commonplace in mathematics, particularly in calculus. The traditional approach to undefinedness in mathematical practice is to treat undefined terms as legitimate, nondenoting terms that can be components of meaningful statements. The traditional approach enables statements about partial functions and undefined terms to be stated very concisely. Unfortunately, the traditiona...
متن کاملThe Proper Treatment of Undefinedness in Constraint Languages
Any sufficiently complex finite-domain constraint modelling language has the ability to express undefined values, for example division by zero, or array index out of bounds. This paper gives the first systematic treatment of undefinedness for finite-domain constraint languages. We present three alternative semantics for undefinedness, and for each of the semantics show how to map models that co...
متن کاملTechnical Report: Defining the Undefinedness of C
This paper investigates undefined behavior in C and offers a few simple techniques for operationally specifying such behavior formally. A semantics-based undefinedness checker for C is developed using these techniques, as well as a test suite of undefined programs. The tool is evaluated against other popular analysis tools, using the new test suite in addition to a third-party test suite. The s...
متن کامل